The LF Seminar Meeting 1 Term Representation Lecture : Frank Pfenning
نویسندگان
چکیده
We describe spine form LF, a version of LF syntactically restricted to canonical forms, and use this framework to begin a logical presentation of the term language used within Twelf, which is (among other things) an implementation of LF. This is not a self-contained document by any means, it is incomplete and furthermore assumes various levels of background in focusing systems, dependent types, LF, the Twelf metalogical framework, and logic programming.
منابع مشابه
Logic Programming in the LF Logical Framework
3 A Meta-Logic for Unification 4 3.1 A First-Order Unification Logic with Quantifier Dependencies . . . . . . . . . . . . . 5 3.2 Transformations for First-Order Unification . . . . . . . . . . . . . . . . . . . . . . . 6 3.3 A Unification Logic for LF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.4 A Generalization of Lλ Unification to LF . . . . . . . . . . . . . . . ....
متن کاملAutomated Theorem Proving in a Simple Meta-Logic for LF
Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally incompatible with induction principles needed to reason about them. In this paper we develop a meta-logic M2 which allows inductive reasoning over such LF encodings, and describe its implementation in Twelf, a special-purpose au...
متن کاملA Proof of the Church-Rosser Theorem and its Representation in a Logical Framework
We give a detailed, informal proof of the Church-Rosser property for the untyped λ-calculus and show its representation in LF. The proof is due to Tait and Martin-Löf and is based on the notion of parallel reduction. The representation employs higher-order abstract syntax and the judgments-as-types principle and takes advantage of term reconstruction as it is provided in the Elf implementation ...
متن کاملOn the Connection between Context-free Grammars and Lambek Categorial Grammars
Overview A method is described for proving the weak equivalence theorem between natural-deduction style Lambek Categorial Grammmars (LCG) and Context-Free Grammars (CFG). The method is achieved using a simple representation for derivations from the associative, product-free Lambek Calculus in the LF metalanguage 10], which can be adapted to the representation of other substruc-tural logics in L...
متن کاملAutomated Theorem Proving in aSimple
Higher-order representation techniques allow elegant encod-ings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally incompatible with induction principles needed to reason about them. In this paper we develop a meta-logic M2 which allows inductive reasoning over LF encodings, and describe its implementation in Twelf, a special-purpose automa...
متن کامل